Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
41	Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§ Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-05-11 07:37:06 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Scheduling Polynomial-time approximation scheme Makespan Time complexity Partition Randomized algorithm Algorithm Integral
42	Simple, Efficient, and Neural Algorithms for Sparse Coding Sanjeev Arora∗ Princeton University, Computer Science Department Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 Mathematics Numerical analysis Algebra Linear algebra Convex optimization Operations research Computational statistics Mathematical optimization K-SVD Sparse approximation Deep learning Stochastic gradient descent
43	Mistakes in Crystal Mark 3 - Jan 2015 As appears in Law Book Law Book Index Page No Add to Reading List Source URL: www.rnswba.org.au Language: English - Date: 2016-06-02 21:28:44 Approximation algorithms APX
44	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
45	PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡ Add to Reading List Source URL: users.eecs.northwestern.edu Language: English - Date: 2009-09-15 22:21:32 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Approximation algorithms Combinatorial optimization Set cover problem Linear programming relaxation Greedy algorithm Facility location problem Reduction
46	ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION PART I: GREEDY PURSUIT JOEL A. TROPP, ANNA C. GILBERT, AND MARTIN J. STRAUSS Abstract. A simultaneous sparse approximation problem requests a good approximation of several Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2007-09-11 17:01:55 Algebra Mathematics Linear algebra Numerical linear algebra Multivariate statistics Signal processing Sparse approximation Matching pursuit Matrix theory Matrix Vector space Sparse dictionary learning
47	FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION Marius Muja, David G. Lowe Computer Science Department, University of British Columbia, Vancouver, B.C., Canada , Add to Reading List Source URL: www.geog.ucsb.edu Language: English - Date: 2013-05-14 18:54:15 Search algorithms Information science Computing Computer programming Machine learning Data mining Approximation algorithms Discrete geometry Nearest neighbor search K-d tree K-nearest neighbors algorithm K-means clustering
48	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
49	Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:20 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Set cover problem Approximation algorithm Facility location problem Dominating set Combinatorial optimization Reduction Algorithm
50	I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio Add to Reading List Source URL: mmds-data.org Language: English - Date: 2016-06-23 15:50:48 Algebra Mathematics Multivariate statistics Numerical analysis Dimension reduction Iterative methods Numerical linear algebra Principal component analysis Singular value decomposition Stochastic optimization Algorithm Sparse dictionary learning